Symmetric unimodal expansions of excedances in colored permutations
نویسندگان
چکیده
We consider several generalizations of the classical γ-positivity of Eulerian polynomials using generating functions and combinatorial theory of continued fractions. For the symmetric group, we prove an expansion formula for inversions and excedances as well as a similar expansion for derangements. We also prove the γ-positivity for Eulerian polynomials of type B and for Eulerian polynomials of r-colored permutations. Our results solve and generalize some recent results in the literature.
منابع مشابه
Unimodal Permutations and Almost-Increasing Cycles
In this paper, we establish a natural bijection between the almost-increasing cyclic permutations of length n and unimodal permutations of length n − 1. This map is used to give a new characterization, in terms of pattern avoidance, of almostincreasing cycles. Additionally, we use this bijection to enumerate several statistics on almost-increasing cycles. Such statistics include descents, inver...
متن کاملRecursions for Excedance Number in Some Permutations Groups
We present recursions for the number of excedances in Coxeter groups of type A and B, as well as in the colored permutation groups Zr ≀ Sn. The proofs use only computations of excedances.
متن کاملRecursions for Excedance Number in Some Permutations Groups
The excedance number for Sn is known to have an Eulerian distribution. Nevertheless, the classical proof uses descents rather than excedances. We present a direct recursive proof which seems to be folklore and extend it to the colored permutation groups Gr,n. The generalized recursion yields some interesting connection to Stirling numbers of the second kind. We also show some logconcavity resul...
متن کاملPermutations Statistics of Indexed and Poset Permutations by Einar Steingrimsson
The definitions of descents and excedances in the elements of the symmetric group Sd are generalized in two different directions. First, descents and excedances are defined for indexed permutations, i.e. the elements of the group Sd = Zn I Sd, where is wreath product with respect to the usual action of Sd by permutation of [d]. It is shown, bijectively, that excedances and descents are equidist...
متن کاملEfficient generating algorithm for permutations with a fixed number of excedances
In this paper, we develop a constant amortized time (CAT) algorithm for generating permutations with a fixed number of excedances. We obtain a Gray code for permutations having one excedance. We also give a bijection between the set of n-length permutations with exactly one excedance and the set Sn(321, 2413, 3412, 21534)\{123 . . . (n− 1)n}. This induces a Gray code for the set Sn(321, 2413, 3...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 52 شماره
صفحات -
تاریخ انتشار 2016